Pointwise Relational Programming
نویسنده
چکیده
The point-free relational calculus has been very successful as a language for discussing general programming principles. However, when it comes to speciic applications, the calculus can be rather awkward to use: some things are more clearly and simply expressed using variables. The combination of variables and relational combinators such as converse and choice yields a kind of nondeterministic functional programming language. We give a semantics for such a language, and illustrate with an example application.
منابع مشابه
Constructing Tournament Representations: An Exercise in Pointwise Relational Programming
List or set comprehensions are a wonderful means to define nondeterministic or relational programs. Despite their beauty, comprehensions are somewhat underused in program calculation. The purpose of this paper is to remind the program-calculation community that comprehensions provide a convenient language for specifying and deriving nondeterministic programs in a pointwise manner. We illustrate...
متن کاملPrinted in Great Britain ORDERED FUNCTIONAL DEPENDENCIES IN RELATIONAL DATABASES
We extend the relational data model to incorporate linear orderings into data domains which we call the ordered relational model The conventional Functional Dependencies FDs are examined in the context of ordered relational databases by using the notion of System Ordering Independence SOI which refers to the desirable scenario that the ordering of tuples in a relation is independent of the impl...
متن کاملPosynomial geometric programming problem subject to max–product fuzzy relation equations
In this article, we study a class of posynomial geometric programming problem (PGPF), with the purpose of minimizing a posynomial subject to fuzzy relational equations with max–product composition. With the help of auxiliary variables, it is converted convert the PGPF into an equivalent programming problem whose objective function is a non-decreasing function with an auxiliary variable. Some pr...
متن کاملLinear programming on SS-fuzzy inequality constrained problems
In this paper, a linear optimization problem is investigated whose constraints are defined with fuzzy relational inequality. These constraints are formed as the intersection of two inequality fuzzy systems and Schweizer-Sklar family of t-norms. Schweizer-Sklar family of t-norms is a parametric family of continuous t-norms, which covers the whole spectrum of t-norms when the parameter is changed...
متن کاملFirst Steps in Pointfree Functional Dependency Theory
When software designers refer to the relational calculus, what they usually mean is the set-theoretic kernel of relational database design “à la Codd” and not the calculus of binary relations which was initiated by De Morgan in the 1860s an eventually became the core of the algebra of programming. Contrary to the intuition that a binary relation is just a particular case of -ary relation, this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000